Locality of orthogonal product states via multiplied copies

In this paper, we consider the LOCC distinguishability of product states. We employ polygons to analyze orthogonal states in any system show that with protocols, distinguish seven states, one can exclude four via a single copy. bipartite systems, result implies N are distinguishable if $$\left\lceil \frac{N}{4}\right\rceil $$ copies allowed, where l\right\rceil for real number l means smallest integer not less than l. multipartite +1$$ allowed. also give theorem how many be excluded copy distinguishing n by protocols system. Not like previous results, our is general set